Logic for A.I. - Solutions

نویسنده

  • Rosalie Iemhoff
چکیده

Ex. 17 Let us call the new system L, i.e. its axioms are all propositional tautologies (Axiom 1) plus the axioms 2> (Axiom 2) and 2φ∧2ψ → 2(φ∧ψ) (Axiom 3), and the rules modus ponens and φ→ ψ 2φ→ 2ψ We have to show that for all formulas φ `K φ ⇔ `L φ. ⇒: For this direction we have to show that L derives all axioms of K and all its rules. Axiom 1 of K is the same as Axiom 1 in L, thus we have nothing to prove. Axiom 2 of K is 2(φ→ ψ)→ (2φ→ 2ψ). We give a derivation of this formula in L: (φ→ ψ) ∧ φ→ ψ 2((φ→ ψ) ∧ φ)→ 2ψ (the rule from L) 2(φ→ ψ) ∧2φ→ 2ψ (axiom 3 of L and propositional logic) 2(φ→ ψ)→ (2φ→ 2ψ) (propositional logic)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Constructionist to Constructivist A.I

The development of artificial intelligence systems has to date been largely one of manual labor. This Constructionist approach to A.I. has resulted in a diverse set of isolated solutions to relatively small problems. Small success stories of putting these pieces together in robotics, for example, has made people optimistic that continuing on this path would lead to artificial general intelligen...

متن کامل

Linkk Oping Electronic Articles in Dynamic Logic Programming Linkk Oping Electronic Articles in Computer and Information Science

In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in their bodies but also in their heads. We start by introducing the notion of an update P U of a logic program P by another logic program U . Subsequently, we provide a precise semantic charact...

متن کامل

Default Reasoning Using Monotonic Logic: A Modest Proposal

This first order paper presents, a simple extension of to include a.default operator. P rodicatEflog+c iules inference s ecified, overning the operator are ? and a mo % el sen ences involvin theory for interpretin is develo e s % based on standard 4 default operators arskian semantics. The resu ting system is trivial1 ar sound. It is argued that (a) this logic provi es an adequate basis for def...

متن کامل

Ultra Low Power Symmetric Pass Gate Adiabatic Logic with CNTFET for Secure IoT Applications

With the advent and development of the Internet of Things, new needs arose and more attention was paid to these needs. These needs include: low power consumption, low area consumption, low supply voltage, higher security and so on. Many solutions have been proposed to improve each one of these needs. In this paper, we try to reduce the power consumption and enhance the security by using SPGAL, ...

متن کامل

Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics

A Rasiowa-Sikorski system is a sequence-type formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author gives examples of applying the R-S formalism to various C.S and A.I. logic, including a logic for reason...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008